Size of Shares and Probability of Cheating in Threshold Schemes
نویسندگان
چکیده
In this paper we study the amount of secret information that must be given to participants in any secret sharing scheme that is secure against coalitions of dishonest participants in the model of Tompa and Woll 20]. We show that any (k; n) threshold secret sharing algorithm in which any coalition of less than k participants has probability of successful cheating less than some > 0 it must give to each participant shares whose sizes are at least the size of the secret plus log 1 : 1 Introduction
منابع مشابه
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another participant reconstruct an invalid secret. We introduce a novel technique which uses universal hash functions to detect such cheating and propose two efficient secret sharing schemes that employ the functions. The first...
متن کاملOptimum Secret Sharing Scheme Secure against Cheating
Tompa and Woll considered a problem of cheaters in (k; n) threshold secret sharing schemes. We rst derive a tight lower bound on the size of shares jV i j for this problem: jV i j (jSj 1)= + 1, where V i denotes the set of shares of participant P i , S denotes the set of secrets, and denotes the cheating probability. We next present an optimum scheme which meets the equality of our bound by usi...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملEfficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
In this paper, we consider three very important issues namely detection, identification and robustness of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase. Towards this we present five different schemes. Among these, first we present two k-out-of-n secret sharing s...
متن کاملDetection of Cheaters in Non-interactive Polynomial Evaluation
In this paper, we consider both theoretical and practical aspects of robust NI-PE (noninteractive polynomial evaluation with detection of cheaters). First, we give a necessary condition of adversary structures for which perfectly robust NI-PE with small communication complexity exists. More precisely, we show that for any positive integers n, m and d > 1, an n-player access structure U , and an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993